全文获取类型
收费全文 | 5444篇 |
免费 | 730篇 |
国内免费 | 472篇 |
专业分类
电工技术 | 148篇 |
综合类 | 295篇 |
化学工业 | 210篇 |
金属工艺 | 385篇 |
机械仪表 | 291篇 |
建筑科学 | 347篇 |
矿业工程 | 62篇 |
能源动力 | 143篇 |
轻工业 | 45篇 |
水利工程 | 288篇 |
石油天然气 | 545篇 |
武器工业 | 17篇 |
无线电 | 467篇 |
一般工业技术 | 189篇 |
冶金工业 | 97篇 |
原子能技术 | 142篇 |
自动化技术 | 2975篇 |
出版年
2024年 | 5篇 |
2023年 | 49篇 |
2022年 | 101篇 |
2021年 | 132篇 |
2020年 | 110篇 |
2019年 | 89篇 |
2018年 | 116篇 |
2017年 | 161篇 |
2016年 | 197篇 |
2015年 | 160篇 |
2014年 | 298篇 |
2013年 | 269篇 |
2012年 | 316篇 |
2011年 | 366篇 |
2010年 | 287篇 |
2009年 | 308篇 |
2008年 | 315篇 |
2007年 | 400篇 |
2006年 | 367篇 |
2005年 | 302篇 |
2004年 | 304篇 |
2003年 | 356篇 |
2002年 | 285篇 |
2001年 | 291篇 |
2000年 | 254篇 |
1999年 | 209篇 |
1998年 | 139篇 |
1997年 | 91篇 |
1996年 | 97篇 |
1995年 | 60篇 |
1994年 | 60篇 |
1993年 | 30篇 |
1992年 | 23篇 |
1991年 | 17篇 |
1990年 | 17篇 |
1989年 | 18篇 |
1988年 | 5篇 |
1986年 | 8篇 |
1985年 | 6篇 |
1984年 | 5篇 |
1983年 | 5篇 |
1982年 | 3篇 |
1980年 | 2篇 |
1979年 | 1篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1974年 | 1篇 |
1965年 | 2篇 |
1962年 | 1篇 |
1959年 | 4篇 |
排序方式: 共有6646条查询结果,搜索用时 156 毫秒
71.
Inverse Procedural Modelling of Trees 总被引:1,自引:0,他引:1
O. Stava S. Pirk J. Kratt B. Chen R. Měch O. Deussen B. Benes 《Computer Graphics Forum》2014,33(6):118-131
Procedural tree models have been popular in computer graphics for their ability to generate a variety of output trees from a set of input parameters and to simulate plant interaction with the environment for a realistic placement of trees in virtual scenes. However, defining such models and their parameters is a difficult task. We propose an inverse modelling approach for stochastic trees that takes polygonal tree models as input and estimates the parameters of a procedural model so that it produces trees similar to the input. Our framework is based on a novel parametric model for tree generation and uses Monte Carlo Markov Chains to find the optimal set of parameters. We demonstrate our approach on a variety of input models obtained from different sources, such as interactive modelling systems, reconstructed scans of real trees and developmental models. 相似文献
72.
M. Schulze J. Martinez Esturo T. Günther C. Rössl H.‐P. Seidel T. Weinkauf H. Theisel 《Computer Graphics Forum》2014,33(3):1-10
Stream surfaces are a well‐studied and widely used tool for the visualization of 3D flow fields. Usually, stream surface seeding is carried out manually in time‐consuming trial and error procedures. Only recently automatic selection methods were proposed. Local methods support the selection of a set of stream surfaces, but, contrary to global selection methods, they evaluate only the quality of the seeding lines but not the quality of the whole stream surfaces. Global methods, on the other hand, only support the selection of a single optimal stream surface until now. However, for certain flow fields a single stream surface is not sufficient to represent all flow features. In our work, we overcome this limitation by introducing a global selection technique for a set of stream surfaces. All selected surfaces optimize global stream surface quality measures and are guaranteed to be mutually distant, such that they can convey different flow features. Our approach is an efficient extension of the most recent global selection method for single stream surfaces. We illustrate its effectiveness on a number of analytical and simulated flow fields and analyze the quality of the results in a user study. 相似文献
73.
Modelling trees according to desired shapes is important for many applications. Despite numerous methods having been proposed in tree modelling, it is still a non‐trivial task and challenging. In this paper, we present a new variational computing approach for generating realistic trees in specific shapes. Instead of directly modelling trees from symbolic rules, we formulate the tree modelling as an optimization process, in which a variational cost function is iteratively minimized. This cost function measures the difference between the guidance shape and the target tree crown. In addition, to faithfully capture the branch structure of trees, several botanical factors, including the minimum total branches volume and spatial branches patterns, are considered in the optimization to guide the tree modelling process. We demonstrate that our approach is applicable to generate trees with different shapes, from interactive design and complex polygonal meshes. 相似文献
74.
Amir Vaxman 《Computer Graphics Forum》2014,33(8):121-131
We present a novel framework for polyhedral mesh editing with face‐based projective maps that preserves planarity by definition. Such meshes are essential in the field of architectural design and rationalization. By using homogeneous coordinates to describe vertices, we can parametrize the entire shape space of planar‐preserving deformations with bilinear equations. The generality of this space allows for polyhedral geometric processing methods to be conducted with ease. We demonstrate its usefulness in planar‐quadrilateral mesh subdivision, a resulting multi‐resolution editing algorithm, and novel shape‐space exploration with prescribed transformations. Furthermore, we show that our shape space is a discretization of a continuous space of conjugate‐preserving projective transformation fields on surfaces. Our shape space directly addresses planar‐quad meshes, on which we put a focus, and we further show that our framework naturally extends to meshes with faces of more than four vertices as well. 相似文献
75.
We address the problem of robust and efficient treatment of element collapse and inversion in corotational FEM simulations of deformable objects in two and three dimensions, and show that existing degeneration treatment methods have previously unreported flaws that seriously threaten robustness and physical plausibility in interactive applications. We propose a new method that avoids such flaws, yields faster and smoother degeneration recovery and extends the range of well‐behaved degenerate configurations without adding significant complexity or computational cost to standard explicit and quasi‐implicit solvers. 相似文献
76.
Interactive rigid body simulation is an important part of many modern computer tools, which no authoring tool nor game engine can do without. Such high‐performance computer tools open up new possibilities for changing how designers, engineers, modelers and animators work with their design problems. This paper is a self contained state‐of‐the‐art report on the physics, the models, the numerical methods and the algorithms used in interactive rigid body simulation all of which have evolved and matured over the past 20 years. Furthermore, the paper communicates the mathematical and theoretical details in a pedagogical manner. This paper is not only a stake in the sand on what has been done, it also seeks to give the reader deeper insights to help guide their future research. 相似文献
77.
Zhenbao Liu Sicong Tang Weiwei Xu Shuhui Bu Junwei Han Kun Zhou 《Computer Graphics Forum》2014,33(7):269-278
Since indoor scenes are frequently changed in daily life, such as re‐layout of furniture, the 3D reconstructions for them should be flexible and easy to update. We present an automatic 3D scene update algorithm to indoor scenes by capturing scene variation with RGBD cameras. We assume an initial scene has been reconstructed in advance in manual or other semi‐automatic way before the change, and automatically update the reconstruction according to the newly captured RGBD images of the real scene update. It starts with an automatic segmentation process without manual interaction, which benefits from accurate labeling training from the initial 3D scene. After the segmentation, objects captured by RGBD camera are extracted to form a local updated scene. We formulate an optimization problem to compare to the initial scene to locate moved objects. The moved objects are then integrated with static objects in the initial scene to generate a new 3D scene. We demonstrate the efficiency and robustness of our approach by updating the 3D scene of several real‐world scenes. 相似文献
78.
Markus Steinberger Michael Kenzel Bernhard Kainz Peter Wonka Dieter Schmalstieg 《Computer Graphics Forum》2014,33(2):105-114
In this paper, we present a new approach for shape‐grammar‐based generation and rendering of huge cities in real‐time on the graphics processing unit (GPU). Traditional approaches rely on evaluating a shape grammar and storing the geometry produced as a preprocessing step. During rendering, the pregenerated data is then streamed to the GPU. By interweaving generation and rendering, we overcome the problems and limitations of streaming pregenerated data. Using our methods of visibility pruning and adaptive level of detail, we are able to dynamically generate only the geometry needed to render the current view in real‐time directly on the GPU. We also present a robust and efficient way to dynamically update a scene's derivation tree and geometry, enabling us to exploit frame‐to‐frame coherence. Our combined generation and rendering is significantly faster than all previous work. For detailed scenes, we are capable of generating geometry more rapidly than even just copying pregenerated data from main memory, enabling us to render cities with thousands of buildings at up to 100 frames per second, even with the camera moving at supersonic speed. 相似文献
79.
Symmetry is a common characteristic in natural and man‐made objects. Its ubiquitous nature can be exploited to facilitate the analysis and processing of computational representations of real objects. In particular, in computer graphics, the detection of symmetries in 3D geometry has enabled a number of applications in modeling and reconstruction. However, the problem of symmetry detection in incomplete geometry remains a challenging task. In this paper, we propose a vote‐based approach to detect symmetry in 3D shapes, with special interest in models with large missing parts. Our algorithm generates a set of candidate symmetries by matching local maxima of a surface function based on the heat diffusion in local domains, which guarantee robustness to missing data. In order to deal with local perturbations, we propose a multi‐scale surface function that is useful to select a set of distinctive points over which the approximate symmetries are defined. In addition, we introduce a vote‐based scheme that is aware of the partiality, and therefore reduces the number of false positive votes for the candidate symmetries. We show the effectiveness of our method in a varied set of 3D shapes and different levels of partiality. Furthermore, we show the applicability of our algorithm in the repair and completion of challenging reassembled objects in the context of cultural heritage. 相似文献
80.
This paper studies the Voronoi diagrams on 2‐manifold meshes based on geodesic metric (a.k.a. geodesic Voronoi diagrams or GVDs), which have polyline generators. We show that our general setting leads to situations more complicated than conventional 2D Euclidean Voronoi diagrams as well as point‐source based GVDs, since a typical bisector contains line segments, hyperbolic segments and parabolic segments. To tackle this challenge, we introduce a new concept, called local Voronoi diagram (LVD), which is a combination of additively weighted Voronoi diagram and line‐segment Voronoi diagram on a mesh triangle. We show that when restricting on a single mesh triangle, the GVD is a subset of the LVD and only two types of mesh triangles can contain GVD edges. Based on these results, we propose an efficient algorithm for constructing the GVD with polyline generators. Our algorithm runs in O(nNlogN) time and takes O(nN) space on an n‐face mesh with m generators, where N = max{m, n}. Computational results on real‐world models demonstrate the efficiency of our algorithm. 相似文献